Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
531	May 21, [removed]Spring 2008 Final Exam Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2008-12-08 16:50:45 Analysis of algorithms Binary trees Asymptotic analysis B-tree Big O notation Time complexity Shortest path problem AVL tree Heap Theoretical computer science Mathematics Computational complexity theory
532	A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CA[removed] Add to Reading List Source URL: stuff.mit.edu Language: English - Date: 2009-05-25 23:54:59 Complexity classes Mathematical optimization Structural complexity theory Analysis of algorithms P versus NP problem NP-complete NP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
533	Hallucination Helps: Energy Efficient Virtual Circuit Routing Antonios Antoniadis∗ Benjamin Moseley§ Sungjin Im† Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2013-07-07 11:17:18 Combinatorial optimization Operations research Network flow Analysis of algorithms Computational complexity theory Time complexity Shortest path problem Cut Flow network Theoretical computer science Mathematics Applied mathematics
534	Securing Applications With CHECKMARX Add to Reading List Source URL: www.owasp.org Language: English - Date: 2011-12-11 14:43:10 Applied mathematics Mathematics Denial-of-service attacks ReDoS Formal languages Tac Algorithm Time complexity Parsing Regular expressions Pattern matching Theoretical computer science
535	Efficient Regret Bounds for Online Bid Optimisation in Budget-Limited Sponsored Search Auctions Long Tran-Thanh1 , Lampros Stavrogiannis1 , Victor Naroditskiy1 Valentin Robu1 , Nicholas R Jennings1 and Peter Key2 1: Univ Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2014-06-20 12:31:45 Analysis of algorithms Estimation theory Normal distribution M-estimator Time complexity Asymptotically optimal algorithm Algorithm Multi-armed bandit Statistics Theoretical computer science Applied mathematics
536	Breaking Symmetry with Agents of Different Speeds Evan Huus (Carleton University) [removed] April 3, 2013 Add to Reading List Source URL: dl.dropboxusercontent.com Language: English Computer science Computational complexity theory Time complexity Big O notation Algorithm XTR Mathematics Applied mathematics Analysis of algorithms
537	Symposium on Theoretical Aspects of Computer Science[removed]Nancy, France), pp[removed]www.stacs-conf.org COLLAPSING AND SEPARATING COMPLETENESS NOTIONS UNDER AVERAGE-CASE AND WORST-CASE HYPOTHESES XIAOYANG GU 1 AND JOHN Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2010-03-04 08:18:12 Complexity classes NP-complete NP Reduction P/poly Advice Many-one reduction Turing reduction Polynomial-time reduction Theoretical computer science Computational complexity theory Applied mathematics
538	SOI 2013 The Swiss Olympiad in Informatics Perfect solution Add to Reading List Source URL: www.soi.ch Language: English - Date: 2012-09-30 17:37:36 Analysis of algorithms Computational complexity theory Dynamic programming Algorithm Time complexity Big O notation Longest increasing subsequence CYK algorithm Theoretical computer science Mathematics Applied mathematics
539	Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states Fabio L. Traversa,1, 2, ∗ Chiara Ramella,2, † Fabrizio Bonani,2, ‡ and Massimiliano Di Ventra1, § arXiv:[removed] Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-12-03 20:27:51 Turing machine Models of computation Mathematical optimization Structural complexity theory Computational complexity theory NP P versus NP problem Reduction P-complete Theoretical computer science Applied mathematics Complexity classes
540	Journal of Machine Learning Research[removed]2801 Submitted 1/08; Revised 9/08; Published[removed]Robust Submodular Observation Selection Andreas Krause Add to Reading List Source URL: www.select.cs.cmu.edu Language: English - Date: 2009-08-13 03:47:05 Computational complexity theory Submodular set function Matroid theory Greedy algorithm Algorithm Optimization problem Selection algorithm Time complexity Reduction Theoretical computer science Mathematics Applied mathematics

UPDATE